Hot-SVD: higher order t-singular value decomposition for tensors based on tensor–tensor product
نویسندگان
چکیده
This paper considers a way of generalizing the t-SVD third-order tensors (regarded as tubal matrices) to arbitrary order $$N$$ [which can be similarly regarded $$(N-1)$$ ]. Such generalization is different from for greater than three (Martin et al. in SIAM J Sci Comput 35(1):A474–A490, 2013). The decomposition called Hot-SVD, since it recognized tensor–tensor product version celebrated higher SVD (HOSVD). existence Hot-SVD proved. To this end, “small-t” transpose introduced. crucial verification serves bridge between and their unfolding matrices. We establish some properties analogous those HOSVD. truncated sequentially are then introduced, with $$\sqrt{N}$$ -error bounds established an $$(N+1)$$ -th-order tensor. provide numerical examples validate Hot-SVD.
منابع مشابه
Singular Value Decomposition (SVD) and Generalized Singular Value Decomposition (GSVD)
The singular value decomposition (SVD) is a generalization of the eigen-decomposition which can be used to analyze rectangular matrices (the eigen-decomposition is definedonly for squaredmatrices). By analogy with the eigen-decomposition, which decomposes a matrix into two simple matrices, the main idea of the SVD is to decompose a rectangular matrix into three simple matrices: Two orthogonal m...
متن کاملMultilinear Singular Value Decomposition for Structured Tensors
The Higher-Order SVD (HOSVD) is a generalization of the Singular Value Decomposition (SVD) to higher-order tensors (i.e. arrays with more than two indices) and plays an important role in various domains. Unfortunately, this decomposition is computationally demanding. Indeed, the HOSVD of a third-order tensor involves the computation of the SVD of three matrices, which are referred to as "modes"...
متن کاملApplications of singular-value decomposition (SVD)
Let A be an m × n matrix with m ≥ n. Then one form of the singular-value decomposition of A is A = UΣV, where U and V are orthogonal and Σ is square diagonal. That is, UUT = Irank(A), V V T = Irank(A), U is rank(A)×m, V is rank(A)× n and Σ = σ1 0 · · · 0 0 0 σ2 · · · 0 0 .. .. . . . .. .. 0 0 · · · σrank(A)−1 0 0 0 · · · 0 σrank(A) is a rank(A)× rank(A) diagonal matrix. In add...
متن کاملSingular Value Decomposition based Steganography Technique for JPEG2000 Compressed Images
In this paper, a steganography technique for JPEG2000 compressed images using singular value decomposition in wavelet transform domain is proposed. In this technique, DWT is applied on the cover image to get wavelet coefficients and SVD is applied on these wavelet coefficients to get the singular values. Then secret data is embedded into these singular values using scaling factor. Different com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational & Applied Mathematics
سال: 2022
ISSN: ['1807-0302', '2238-3603']
DOI: https://doi.org/10.1007/s40314-022-02107-7